Some codes related to BCH-codes of low dimension
نویسندگان
چکیده
منابع مشابه
Some codes related to BCH-codes of low dimension
We construct a large number of record-breaking binary, ternary and quaternary codes. Our methods involve the study of BCH-codes over larger fields, concatenation, construction X and variants of the Griesmer construction (residual codes). 1 Review of the theory Let IFq be the ground field, F = IFq2 . Denote the interval {i, i + 1, . . . , j} ⊂ ZZ/(q−1)ZZ by [i, j]. Let A = [i, j] ⊂ ZZ/(q−1)ZZ. I...
متن کاملSome Optimal Codes as Tanner Codes with BCH Component Codes
In this paper we study a class of graph codes with BCH component codes as affine variety codes. We are able to find some optimal binary and ternary codes as Tanner codes with BCH component codes. We choose a special subgraph of the point-line incidence plane of P(2, q) as the Tanner graph, and we are able to describe the codes using Gröbner basis.
متن کاملA Family of 2-weight Codes Related to Bch-codes
For every prime-power q and every pair of natural numbers m n 0 we construct a q-ary linear code of length q m (q n 0 ? 1)(q n 0 ? q n 0 ?m + 1)=(q?1) and dimension 3n 0 ; whose only nonzero weights are q 2n 0 +m?1 ? q 2n 0 ?1 and q 2n 0 +m?1 ? q 2n 0 ?1 + q n 0 +m?1 : These code parameters and those of the corresponding family of strongly regular graphs are new in odd characteristic.
متن کاملDimension of nonbinary antiprimitive BCH codes
Bose-Chaudhuri-Hocquenghem (BCH) codes have been widely employed in satellite communications, compact disc players, DVDs, disk drives, solidstate drives, two-dimensional bar codes and in cryptography more recently. However, there is only a little known about primitive BCH codes, let alone nonprimitive ones. In this paper, dimension of a special class of nonprimitive BCH codes of length n = q + ...
متن کاملSome Hermitian Dual Containing BCH Codes and New Quantum Codes
Let q = 3l+2 be a prime power. Maximal designed distances of imprimitive Hermitian dual containing q2-ary narrow-sense (NS) BCH codes of length n = (q 6−1) 3 and n = 3(q 2 −1)(q2 +q+1) are determined. For each given n, non-narrow-sense (NNS) BCH codes which achieve such maximal designed distances are presented, and a series of NS and NNS BCH codes are constructed and their parameters are comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1999
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00037-0